/*
 *      Copyright (C) 2010-2017 Hendrik Leppkes
 *      http://www.1f0.de
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License along
 *  with this program; if not, write to the Free Software Foundation, Inc.,
 *  51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */

#pragma once

#include <assert.h>

template <class T>
class FloatingAverage
{
public:
  FloatingAverage(const unsigned int iNumSamples = 10) {
    SetNumSamples(iNumSamples);
  }

  ~FloatingAverage() {
    free(m_Samples);
  }

  void SetNumSamples(const unsigned int iNumSamples) {
    if (iNumSamples > m_NumSamplesAlloc) {
      m_Samples = (T *)realloc(m_Samples, iNumSamples * sizeof(T));
      m_NumSamplesAlloc = iNumSamples;
    }
    memset(m_Samples, 0, sizeof(T) * m_NumSamplesAlloc);
    m_NumSamples = iNumSamples;
    m_CurrentSample = 0;
  }

  void Sample(const T fSample) {
    m_Samples[m_CurrentSample] = fSample;
    if (++m_CurrentSample >= m_NumSamples) {
      m_CurrentSample = 0;
    }
  }

  T Average() const {
    T fAverage = 0;
    for(unsigned int i = 0; i < m_NumSamples; ++i) {
      fAverage += m_Samples[i] / m_NumSamples;
    }
    return fAverage;
  }

  T Minimum() const {
    T min = m_Samples[0];
    for(unsigned int i = 1; i < m_NumSamples; ++i) {
      if (m_Samples[i] < min)
        min = m_Samples[i];
    }
    return min;
  }

  T AbsMinimum() const {
    T min = m_Samples[0];
    for(unsigned int i = 1; i < m_NumSamples; ++i) {
      if (abs(m_Samples[i]) < abs(min))
        min = m_Samples[i];
    }
    return min;
  }

  T Maximum() const {
    T max = m_Samples[0];
    for(unsigned int i = 1; i < m_NumSamples; ++i) {
      if (m_Samples[i] > max)
        max = m_Samples[i];
    }
    return max;
  }

  T AbsMaximum() const {
    T max = m_Samples[0];
    for(unsigned int i = 1; i < m_NumSamples; ++i) {
      if (abs(m_Samples[i]) > abs(max))
        max = m_Samples[i];
    }
    return max;
  }

  void OffsetValues(const T value) const {
    for(unsigned int i = 0; i < m_NumSamples; ++i) {
      m_Samples[i] += value;
    }
  }

  unsigned int CurrentSample() const {
    return m_CurrentSample;
  }

private:
  T *m_Samples                   = nullptr;
  unsigned int m_NumSamples      = 0;
  unsigned int m_NumSamplesAlloc = 0;
  unsigned int m_CurrentSample   = 0;
};
